منابع مشابه
Digital Search Trees Revisited
Several algorithms have been proposed which build search trees using digital properties of the search keys. A general approach to the study of the average case performance of such algorithms is discussed, with particular attention to the analysis of the digital search tree structures of Coffman and Eve. Specifically, the method leads to the solution of a problem left open by Knuth, finding the ...
متن کاملDigital Search Trees Again Revisited: The Internal Path Length Perspective
This paper studies the asymptotics of the variance fOf the internal path length in a. symmetric digital search tree. The problem was open up to now. We prove that COf the binary digital search tree the variance is asymptolically equal 10 0.26600 ... · N + N6(1og2 N) where N is the number of stored records and 6(:z:) is a. periodic function of mean zero and a very small amplitude. This result im...
متن کاملProbabilistic analysis of the asymmetric digital search trees
In this paper, by applying three functional operators the previous results on the (Poisson) variance of the external profile in digital search trees will be improved. We study the profile built over $n$ binary strings generated by a memoryless source with unequal probabilities of symbols and use a combinatorial approach for studying the Poissonized variance, since the probability distribution o...
متن کاملRestructuring binary search trees revisited
Binary search trees are a fundamental data structure. There are two complexity metrics commonly associated with them: the maximum number of comparisons made during a search and the expected number of comparisons made during a search. Minimizing these metrics, separately or together, has been extensively studied. The difficulty of doing this depends on how much information is given. There are 2n...
متن کاملprobabilistic analysis of the asymmetric digital search trees
in this paper, by applying three functional operators the previous results on the(poisson) variance of the external profile in digital search trees will be improved. we study the profile built over $n$ binary strings generated by a memoryless source with unequal probabilities of symbols and use a combinatorial approach for studying the poissonized variance, since the probability distribution of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1986
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0215054